A new multiobjective evolutionary algorithm

The Pareto-based approaches have shown some success in designing multiobjective evolutionary algorithms. Their methods of fitness assignment are mainly from the information of dominated and nondominated individuals. On the top of the hierarchy of multiobjective evolutionary algorithms, the Strength Pareto Evolutionary Algorithm (SPEA) has been elaborately designed with this principle in mind. In this paper, we propose a (μ + λ) multiobjective evolutionary algorithm ((μ + λ)MEA), which discards the dominated individuals in each generation. The comparisons of the experimental results demonstrate that the (μ + λ)MEA outperforms SPEA on five benchmark functions with less computational efforts.